IMPLEMENTATION OF HAMMING-CUT-MATCHING ALGORITHM IN IRIS RECOGNITION
DOI:
https://doi.org/10.17605/OSF.IO/Y8Q92Abstract
This paper deals with the basics of iris, its properties and how it adds some advantageous features to recognize the correct person. In this paper we discuss the details regarding the information about how the iris is located, to distinguish it from other parts of the eye, how the scanner scans the whole pattern of the iris while enrolling and matching and how the scanned patterns are converted into 256 bytes of data so that it can be stored in the database. We compare the iris codes of the current person who wants to access the database and gives the matched results to the user accordingly. This paper includes the implementation of HAMMINGCUT-MATCHING algorithm which reduces the comparison time for matching the iris code with database so that we can use iris recognition.
Downloads
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.















